Logarithmic vector fields and multiplication table
نویسنده
چکیده
Susumu TANABÉ Abstract. This is a review article on the Gauss-Manin system associated to the complete intersection singularities of projection. We show how the logarithmic vector fields appear as coefficients to the Gauss-Manin system (Theorem 2.7). We examine further how the multiplication table on the Jacobian quotient module calculates the logarithmic vector fields tangent to the discriminant and the bifurcation set (Proposition 3.3, Proposition 5.3). As applications, we establish signature formulae for Euler characteristics of real hypersurfaces (Theorem 4.2) and real complete intersections (Theorem 5.2) by means of these fields.
منابع مشابه
Susumu Tanabé
Susumu TANABÉ Abstract. This is a review article on the Gauss-Manin system associated to the complete intersection singularities of projection. We show how the logarithmic vector fields appear as coefficients to the Gauss-Manin system (Theorem 2.7). We examine further how the multiplication table on the Jacobian quotient module calculates the logarithmic vector fields tangent to the discriminan...
متن کاملSemiinvariants of Finite Reflection Groups
Let G be a finite group of complex n× n unitary matrices generated by reflections acting on C. Let R be the ring of invariant polynomials, and χ be a multiplicative character of G. Let Ω be the R-module of χ-invariant differential forms. We define a multiplication in Ω and show that under this multiplication Ω has an exterior algebra structure. We also show how to extend the results to vector f...
متن کاملA Hardware Algorithm for Fast Logarithmic Computation with Exponential Convergence Rate
A hardware algorithm is proposed for improving the speed of the linear digitrecurrence logarithmic algorithm. The convergence rate of this logarithmic algorithm is exponential. Furthermore, the size of the lookup tables used in the algorithm is smaller than the size of the lookup tables used in the digit-recurrence algorithms. When the word length of the operand is less than or equal to 64 bits...
متن کاملNearly Optimal Bit Complexity Bounds for Computations with Structured Matrices
We present optimal, up to poly-logarithmic factors, bit complexity results for basic operations, matrix-vector multiplication and solving non-singular linear systems, with structured matrices.
متن کاملSubquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
We study Dickson bases for binary field representation. Such representation seems interesting when no optimal normal basis exists for the field. We express the product of two elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space and logarithmic in time.
متن کامل